degree distance and gutman index of corona product of graphs

نویسندگان

v. sheeba agnes

چکیده

in this paper, the degree distance and the gutman index of the corona product of two graphs are determined. using the results obtained, the exact degree distance and gutman index of certain classes of graphs are computed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

متن کامل

Product version of reciprocal degree distance of composite graphs

A {it topological index} of a graph is a real number related to the graph; it does not depend on labeling or pictorial representation of a graph. In this paper, we present the upper bounds for the product version of reciprocal degree distance of the tensor product, join and strong product of two graphs in terms of other graph invariants including the Harary index and Zagreb indices.

متن کامل

Generalized Degree Distance of Strong Product of Graphs

In this paper, the exact formulae for the generalized degree distance, degree distance and reciprocal degree distance of strong product of a connected and the complete multipartite graph with partite sets of sizes m0, m1, . . . , mr&minus1 are obtained. Using the results obtained here, the formulae for the degree distance and reciprocal degree distance of the closed and open fence graphs are co...

متن کامل

The Multiplicative Version of Degree Distance and the Multiplicative Version of Gutman Index of Strong Product of some Graphs

In this paper, we present the exact formulae for the multiplicative version of degree distance and the multiplicative version of Gutman index of strong product of graphs in terms of other graph invariants including the Wiener index and Zagreb index. Finally, we apply our results to the multiplicative version of degree distance and the multiplicative version of Gutman index of open and closed fe...

متن کامل

degree distance and gutman index of increasing trees

‎the gutman index and degree distance of a connected graph $g$ are defined as‎ ‎begin{eqnarray*}‎ ‎textrm{gut}(g)=sum_{{u,v}subseteq v(g)}d(u)d(v)d_g(u,v)‎, ‎end{eqnarray*}‎ ‎and‎ ‎begin{eqnarray*}‎ ‎dd(g)=sum_{{u,v}subseteq v(g)}(d(u)+d(v))d_g(u,v)‎, ‎end{eqnarray*}‎ ‎respectively‎, ‎where‎ ‎$d(u)$ is the degree of vertex $u$ and $d_g(u,v)$ is the distance between vertices $u$ and $v$‎. ‎in th...

متن کامل

the hyper edge-wiener index of corona product of graphs

let $g$ be a simple connected graph. the edge-wiener index $w_e(g)$ is the sum of all distances between edges in $g$, whereas the hyper edge-wiener index $ww_e(g)$ is defined as {footnotesize $w{w_e}(g) = {frac{1}{2}}{w_e}(g) + {frac{1}{2}} {w_e^{2}}(g)$}, where {footnotesize $ {w_e^{2}}(g)=sumlimits_{left{ {f,g} right}subseteq e(g)} {d_e^2(f,g)}$}. in this paper, we present explicit formula fo...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
transactions on combinatorics

ناشر: university of isfahan

ISSN 2251-8657

دوره 4

شماره 3 2015

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023